منابع مشابه
Adaptive precision LLL and Potential-LLL reductions with Interval arithmetic
Lattice reduction is fundamental in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra–Lenstra–Lovász reduction algorithm (called LLL or L) has been improved in many ways through the past decades and remains one of the central tool for reducing lattice basis. In particular, its floating-point variants — where the long-integer arithmetic requi...
متن کاملA KZ Reduction Algorithm
The Korkine-Zolotareff (KZ) reduction is one of the often used reduction strategies for decoding lattices. A KZ reduction algorithm involves solving shortest vector problems (SVPs) and basis expansion. In this paper, first we improve the commonly used Schnorr-Euchner search strategy for solving SVPs. Then, we derive upper bounds on the magnitudes of the entries of any solution of a SVP when its...
متن کاملTHE CONSTITUTION OF VITAMIN Kz*
The isolation of vitamin Kz as a yellow crystalline compound melting at 53.5-54.5” has recently been reported from this laboratory (McKee, Binkley, MacCorquodale, Thayer, and Doisy, 1939; McKee, Binkley, Thayer, MacCorquodale, and Doisy, 1939). From the analytical data it was impossible to decide definitely on a formula for vitamin Kz. The formula C&H5402 was used for all calculations, although...
متن کاملKz-monadic Categories and Their Logic
Given an order-enriched category, it is known that all its KZ-monadic subcategories can be described by Kan-injectivity with respect to a collection of morphisms. We prove the analogous result for Kan-injectivity with respect to a collection H of commutative squares. A square is called a Kan-injective consequence of H if by adding it to H Kan-injectivity is not changed. We present a sound logic...
متن کاملLifting as a KZ-Doctrine
Synopsis. In a cartesian closed category with an initial object and a dominance that classiies it, an intensional notion of approximation between maps |the path relation (c.f. link relation)| is deened. It is shown that if such a category admits strict/upper-closed factorisations then it preorder-enriches (as a cartesian closed category) with respect to the path relation. By imposing further ax...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2017
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2017.2708020